Unique factorisation rings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantised coordinate rings of semisimple groups are unique factorisation domains

We show that the quantum coordinate ring of a semisimple group is a unique factorisation domain in the sense of Chatters and Jordan in the case where the deformation parameter q is a transcendental element.

متن کامل

Unique factorisation of additive induced-hereditary properties

An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let P1, . . . ,Pn be additive hereditary graph properties. A graph G has property (P1 ◦ · · · ◦Pn) if there is a partition (V1, . . . , Vn) of V (G) into n sets such that, for all i, the induced subgraph G[Vi] is in Pi. A property P is reducible if there are propert...

متن کامل

Unique factorisation lifting functors and categories of linearly-controlled processes

We consider processes consisting of a category of states varying over a control category as prescribed by a unique factorisation lifting functor. After a brief analysis of the structure of general processes in this setting, we restrict attention to linearly-controlled ones. To this end, we introduce and study a notion of path-linearisable category in which any two paths of morphisms with equal ...

متن کامل

Factorisation is not unique for higher dimensional knots

Nutzungsbedingungen Mit dem Zugriff auf den vorliegenden Inhalt gelten die Nutzungsbedingungen als akzeptiert. Die angebotenen Dokumente stehen für nicht-kommerzielle Zwecke in Lehre, Forschung und für die private Nutzung frei zur Verfügung. Einzelne Dateien oder Ausdrucke aus diesem Angebot können zusammen mit diesen Nutzungsbedingungen und unter deren Einhaltung weitergegeben werden. Die Spei...

متن کامل

Walk-Sums, Continued Fractions and Unique Factorisation on Digraphs

We demonstrate that any walk on a directed graph G can be decomposed into an underlying simple path and a nested collection of bare cycles, where simple paths and bare cycles are open and closed walks that are forbidden from visiting any vertex more than once. We define a convention for the nesting structure of the bare cycles that makes this path decomposition unique. In contrast to existing d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1992

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500005526